Optimal Auction Design in a Multi-unit Environment: The Case of Sponsored Search Auctions
نویسندگان
چکیده
We characterize the optimal (revenue maximizing) auction for sponsored search advertising. We show that a search engine’s optimal reserve price is independent of the number of bidders. Using simulations, we consider the changes that result from a search engine’s choice of reserve price and from changes in the number of participating advertisers.
منابع مشابه
A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملMechanism Design for Sponsored Search Auctions
The sponsored search auction problem was introduced briefly as an example in Chapter 1. In this chapter, we study this problem in more detail to illustrate a compelling application of mechanism design. We first describe a framework to model this problem as a mechanism design problem under a reasonable set of assumptions. Using this framework, we describe three well known mechanisms for sponsore...
متن کاملOn Multiple Round Sponsored Search Auctions with Budgets
In a sponsored search auction the advertisement slots on a search result page are generally ordered by click-through rate. Bidders have a valuation, which is usually assumed to be linear in the click-through rate, a budget constraint, and receive at most one slot per search result page (round). We study multi-round sponsored search auctions, where the different rounds are linked through the bud...
متن کاملClinching Auctions with Online Supply
Auctions for perishable goods such as internet ad inventory need to make real-time allocationand pricing decisions as the supply of the good arrives in an online manner, without knowing theentire supply in advance. These allocation and pricing decisions get complicated when buyershave some global constraints. In this work, we consider a multi-unit model where buyers haveglob...
متن کامل